OccBin: A toolkit for solving dynamic models with occasionally binding constraints easily
نویسندگان
چکیده
منابع مشابه
Algorithms for Solving Dynamic Models with Occasionally Binding Constraints
We describe and compare several algorithms for approximating the solution to a model in which inequality constraints occasionally bind. Their performance is evaluated and compared using various parameterizations of the one sector growth model with irreversible investment. We develop parameterized expectation algorithms which, on the basis of speed, accuracy and convenience of implementation, ap...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملOptimal Fiscal and Monetary Policy With Occasionally Binding Zero Bound Constraints
Previous studies on fiscal policy at the zero bound have focused on models with perfect foresight. However, the recent economic environment motivating such research is characterized by a high degree of uncertainty. This paper studies optimal government spending and monetary policy when the nominal interest rate is subject to the zero lower bound constraint in a stochastic environment. In the pr...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولSolving set constraints for greatest models
In set-based program analysis, one rst infers a set constraint ' from a program and then, in a constraintsolving process, one transforms ' into an e ective representation of sets of program values. Heintze and Ja ar have thus analyzed logic programs with respect to the least-model semantics. In this paper, we present a set-based analysis of logic programs with respect to the greatest model sema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Monetary Economics
سال: 2015
ISSN: 0304-3932
DOI: 10.1016/j.jmoneco.2014.08.005